DCI: a Hybrid Algorithm for Frequent Set Counting
نویسندگان
چکیده
منابع مشابه
A Scalable Multi-Strategy Algorithm for Counting Frequent Sets
In this paper we present DCI, a new data mining algorithm for frequent set counting. We also discuss in depth the parallelization strategies used in the design of ParDCI, the distributed and multi-threaded algorithm derived from DCI. Multiple heuristics strategies are adopted within DCI, so that the algorithm is able to adapt its behavior not only to the features of the specific computing platf...
متن کاملAdaptive and Resource-Aware Mining of Frequent Sets
The performance of an algorithm that mines frequent sets from transactional databases may severely depend on the specific features of the data being analyzed. Moreover, some architectural characteristics of the computational platform used – e.g. the available main memory – can dramatically change the runtime behaviors of the algorithm. In this paper we present DCI (Direct Count & Intersect), an...
متن کاملAn Efficient Parallel and Distributed Algorithm for Counting Frequent Sets
Due to the huge increase in the number and dimension of available databases, efficient solutions for counting frequent sets are nowadays very important within the Data Mining community. Several sequential and parallel algorithms were proposed, which in many cases exhibit excellent scalability. In this paper we present ParDCI, a distributed and multithreaded algorithm for counting the occurrence...
متن کاملMining Complete Hybrid Sequential Patterns
discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and implement the CHSPAM algorithm to remedy the problem. CHSPAM first builds the Supplemented Frequent One Sequence itemset (SFOS) to collect items that may appear in a frequent hybrid sequential pattern. It then constructs...
متن کاملA Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs
This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007